PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
نویسندگان
چکیده
منابع مشابه
Polynomial Interior Point Algorithms for General Linear Complementarity Problems
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCPs without requiring some special property of the coefficient matrix. Following our recently published ideas we generalize affine scaling and predictor-corrector interior point algorithms to solve LCPs with general matrices in EP-sense, namely, ...
متن کاملA Class of Linear Complementarity Problems Solvable in Polynomial Time
We describe a “condition” number for the linear complementarity problem (LCP), which characterizes the degree of difficulty for its solution when a potential reduction algorithm is used. Consequently, we develop a class of LCPs solvable in polynomial time. The result suggests that the convexity (or positive semidefiniteness) of the LCP may not be the basic issue that separates LCPs solvable and...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملA Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
No part of this report may be reproduced in any form, by print, photoprint, microolm or any other means without written permis
متن کاملA polynomial-time algorithm for a class of linear complementarity problems
is known as a linear complementarity problem. Under the assumption that M is positive semidefinite, this paper presents an algorithm that solves the problem in O(n 3 L) arithmetic operations by tracing the path of centers, {(x, y) E S: x~y~ = I.* (i = 1, 2 , . . . , n) for some/~ > 0} of the feasible region S = {(x, y) >~ 0: y = Mx + q}, where L denotes the size of the input data of the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1989
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.32.75